Random matching problems on the complete graph
نویسندگان
چکیده
منابع مشابه
ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...
متن کاملOn spectral properties for graph matching and graph isomorphism problems
Problems related to graph matching and isomorphisms are very important both from a theoretical and practical perspective, with applications ranging from image and video analysis to biological and biomedical problems. The graph matching problem is challenging from a computational point of view, and therefore different relaxations are commonly used. Although common relaxations techniques tend to ...
متن کاملThe Random-cluster Model on the Complete Graph
Béla Bollobás, Geoffrey Grimmett, Svante Janson Abstract. The random-cluster model of Fortuin and Kasteleyn contains as special cases the percolation, Ising, and Potts models of statistical physics. When the underlying graph is the complete graph on n vertices, then the associated processes are called ‘mean-field’. In this study of the mean-field random-cluster with parameters p = λ/n and q, we...
متن کاملNP-Complete Stable Matching Problems
This paper concerns the complexity analysis of the roommate problem and intern assignment problem with couples. These are two special cases of the matching problems known as stable matching. The roommate problem is that of assigning a set of people to rooms of exactly two occupants in accordance with the preferences of the members of the set. The intern assignment problem with couples is that o...
متن کاملOn the Complete Convergence ofWeighted Sums for Dependent Random Variables
We study the limiting behavior of weighted sums for negatively associated (NA) random variables. We extend results in Wu (1999) and a theorem in Chow and Lai (1973) for NA random variables.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2008
ISSN: 1083-589X
DOI: 10.1214/ecp.v13-1372